Papers with unambiguous analysis
BabyFST - Towards a Finite-State Based Computational Model of Ancient Babylonian (2020.lrec-1)
Copied to clipboard
| Challenge: | morphological analyzer for Akkadian is not yet available for the extinct language . we present a general finite-state based model for Babylonian that can achieve a coverage of 97.3% and a recall of 93.7% on token level. |
| Approach: | They propose a general finite-state based morphological model for Babylonian that can achieve a coverage of 97.3% and recall up to 93.7% on lemmatization and POS-tagging tasks. |
| Outcome: | The proposed model can achieve coverage and recall of 97.3% on lemmatization and POS-tagging tasks on token level from a transcribed input. |